The random fractional matching problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Matching in the College Admissions Problem

In the college admissions problem, we consider the incentives confronting agents who face the prospect of being matched by a random stable mechanism. We provide a fairly complete characterization of ordinal equilbria. Namely, every ordinal equilibrium yields a degenerate probability distribution. Furthermore, individual rationality is a necessary and su¢ cient condition for an equilibrium outco...

متن کامل

The matching interdiction problem in dendrimers

The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...

متن کامل

Random fractional functional differential equations

In this paper, we prove the existence and uniqueness results to the random fractional functional differential equations under assumptions more general than the Lipschitz type condition. Moreover, the distance between exact solution and appropriate solution, and the existence extremal solution of the problem is also considered.

متن کامل

One-loop diagrams in the Random Euclidean Matching Problem

The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e., the optimal matching problem between points randomly distributed on a d-dimensional Euclidean space, where the cost to minimize depends on the points' pairwise distances. Using May...

متن کامل

Concentration of the cost of a random matching problem

Let Mn be the minimum cost of a perfect matching on a complete graph on n vertices whose edges are assigned independent exponential costs. It follows from work of D. Aldous that Mn converges in probability to π2/12. This was earlier conjectured by M. Mézard and G. Parisi. We establish the more precise result that E ∣Mn − π2/12 ∣∣ = O(n−1/2).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2018

ISSN: 1742-5468

DOI: 10.1088/1742-5468/aabbc8